Discrete Optimal View Path Planning
نویسندگان
چکیده
This paper presents a discrete model of a sensor path planning problem, with a long-term planning horizon. The goal is to minimize the covariance of the reconstructed structures while meeting constraints on the length of the traversed path of the sensor. The sensor is restricted to move on a graph representing a discrete set of configurations, and additional constraints can be incorporated by altering the graph connectivity. This combinatorial problem is formulated as an integer semi-definite program, the relaxation of which provides both a lower bound on the objective cost and input to a proposed genetic algorithm for solving the original problem. An evaluation on synthetic data indicates good performance.
منابع مشابه
Robot Path Planning Using Cellular Automata and Genetic Algorithm
In path planning Problems, a complete description of robot geometry, environments and obstacle are presented; the main goal is routing, moving from source to destination, without dealing with obstacles. Also, the existing route should be optimal. The definition of optimality in routing is the same as minimizing the route, in other words, the best possible route to reach the destination. In most...
متن کاملNeural Network Modelling of Optimal Robot Movement Using Branch and Bound Tree
In this paper a discrete competitive neural network is introduced to calculate the optimal robot arm movements for processing a considered commitment of tasks, using the branch and bound methodology. A special method based on the branch and bound methodology, modified with a travelling path for adapting in the neural network, is introduced. The main neural network of the system consists of diff...
متن کاملOptimal Path Planning under Priori Information in Stochastic, Time-varying Networks
A novel path planning approach is presented to solve optimal path in stochastic, time-varying networks under priori traffic information. Most existing studies make use of dynamic programming to find optimal path. However, those methods are proved to be unable to obtain global optimal value, moreover, how to design efficient algorithms is also another challenge. This paper employs a decision the...
متن کاملEfficient Motion Planning for Problems Lacking Optimal Substructure
We consider the motion-planning problem of planning a collision-free path of a robot in the presence of risk zones. The robot is allowed to travel in these zones but is penalized in a super-linear fashion for consecutive accumulative time spent there. We suggest a natural cost function that balances path length and risk-exposure time. Specifically, we consider the discrete setting where we are ...
متن کاملFinite Abstractions of Discrete-time Linear Systems and Its Application to Optimal Control
Optimal control and reachability analysis of continuous-state systems often require computational algorithms with high complexity. The use of finite abstractions of continuous-state systems reduces such problems to path-planning problems on directed graphs with a finite number of nodes, which can be computed efficiently. In this research, we propose a method to design an approximately bisimilar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015